Cyclic coloration of 3-polytopes
نویسندگان
چکیده
منابع مشابه
On Gale and braxial polytopes
Cyclic polytopes are characterized as simplicial polytopes satisfying Gale’s evenness condition (a combinatorial condition on facets relative to a fixed ordering of the vertices). Periodically-cyclic polytopes are polytopes for which certain subpolytopes are cyclic. Bisztriczky discovered a class of periodically-cyclic polytopes that also satisfy Gale’s evenness condition. The faces of these po...
متن کاملThe Generalized Baues Problem for Cyclic Polytopes II Preprint SC 98-43 (Januar 1999) THE GENERALIZED BAUES PROBLEM FOR CYCLIC POLYTOPES II
Given an affine surjection of polytopes : P ! Q, the Generalized Baues Problem asks whether the poset of all proper polyhedral subdivisions of Q which are induced by the map has the homotopy type of a sphere. We extend earlier work of the last two authors on subdivisions of cyclic polytopes to give an affirmative answer to the problem for the natural surjections between cyclic polytopes : C(n; ...
متن کاملThe Generalized Baues Problem for Cyclic Polytopes
The Generalized Baues Problem asks whether for a given point configuration the order complex of all its proper polyhedral subdivisions, partially ordered by refinement, is homotopy equivalent to a sphere. In this paper, an affirmative answer is given for the vertex sets of cyclic polytopes in all dimensions. This yields the first non-trivial class of point configurations with neither a bound on...
متن کاملThe Generalized Baues Problem for Cyclic Polytopes I
An important special case of the Generalized Baues Problem asks whether the order complex of all proper polyhedral subdivisions of a given point configuration, partially ordered by refinement, is homotopy equivalent to a sphere. In this paper, an affirmative answer is given for the vertex sets of cyclic polytopes in all dimensions. This yields the first non-trivial class of point configurations...
متن کاملThe maximum number of faces of the Minkowski sum of two convex polytopes
We derive tight bounds for the maximum number of k-faces, 0 ≤ k ≤ d − 1, of the Minkowski sum, P1 ⊕ P2, of two ddimensional convex polytopes P1 and P2, as a function of the number of vertices of the polytopes. For even dimensions d ≥ 2, the maximum values are attained when P1 and P2 are cyclic d-polytopes with disjoint vertex sets. For odd dimensions d ≥ 3, the maximum values are attained when ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 11 شماره
صفحات -
تاریخ انتشار 1987